A characterization of Thompson digraphs
نویسندگان
چکیده
منابع مشابه
Thompson Digraphs: A Characterization
A nite-state machine is called a Thompson machine if it can be constructed from a regular expression using Thompson's construction. We call the underlying digraph of a Thompson machine a Thompson di-graph. We establish and prove a characterization of Thompson digraphs. As one application of the characterization, we give an algorithm that generates an equivalent regular expression from a Thompso...
متن کاملA characterization of Thompson digraphs
A nite-state machine is called a Thompson machine if it can be constructed from a regular expression using Thompson's construction. We call the underlying digraph of a Thompson machine a Thompson digraph. We characterize Thompson digraphs and, as one application of the characterization, we give an algorithm that generates an equivalent regular expression from a Thompson machine in time linear i...
متن کاملThompson-like Characterization of the Solvable Radical
We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x ∈ G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite dimensional Lie algebras and some classes of infinite groups. We also consider a similar problem for pairs of elements.
متن کاملThompson-like Characterization of the Solvable Radical
We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x ∈ G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite dimensional Lie algebras and some classes of infinite groups. To Charles Leedham-Green on his 65th birthday
متن کاملRecognition and Characterization of Chronological Interval Digraphs
Interval graphs admit elegant ordering and structural characterizations as well as linear time recognition algorithms. On the other hand, the usual interval digraphs lack all three of these characteristics. In this paper we identify another natural digraph analogue of interval graphs that we call “chronological interval digraphs”. By contrast, the new class admits an ordering characterization, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00299-3